The quadratic balanced optimization problem
نویسندگان
چکیده
منابع مشابه
The quadratic balanced optimization problem
We introduce the quadratic balanced optimization problem (QBOP) which can be used to model equitable distribution of resources with pairwise interaction. QBOP is strongly NP-hard even if the family of feasible solutions has a very simple structure. Several general purpose exact and heuristic algorithms are presented. Results of extensive computational experiments are reported using randomly gen...
متن کاملQuadratic third-order tensor optimization problem with quadratic constraints
Quadratically constrained quadratic programs (QQPs) problems play an important modeling role in many diverse problems. These problems are in general NP hard and numerically intractable. Semidefinite programming (SDP) relaxations often provide good approximate solutions to these hard problems. For several special cases of QQP, e.g., convex programs and trust region subproblems, SDP relaxation pr...
متن کاملAnt Colony Optimization for Quadratic Assignment Problem
THE quadratic assignement problem (QAP) can be described as an optimizing the assignment a set of facilities to a set of locations with given costs between the locations and given flows between the facilities in order to minimize the sum of the product between flows and distances. A concrete example, would be a hospital planning optimization the location of various medical facilities in order t...
متن کاملsolving quadratic assignment problem (qap) using invasive weed optimization algorithm
a new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the well-known quadratic assignment problem (qap) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. a set of reference numerical problems from qaplib is taken in order to evaluate the efficiency of the algorithm compared with the previous ones wh...
متن کاملContinuous Optimization Methods for the Quadratic Assignment Problem
TAO HUANG: Continuous Optimization Methods for the Quadratic Assignment Problem (Under the direction of Jon W. Tolle) In this dissertation we have studied continuous optimization techniques as they are applied in nonlinear 0-1 programming. Specifically, the methods of relaxation with a penalty function have been carefully investigated. When the strong equivalence properties hold, we are guarant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2014
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2014.01.001